An Interactive Approach for Bicriteria Transportation Problems
نویسندگان
چکیده
An interactive approach for Bicriteria Transportation Problems, allowing for non-integer solutions, is presented. The decision-maker (DM) conducts the search by introducing upper bounds on the values of one or both criteria, adding one/two additional constraints to the original problem structure. So, usual algorithms for solving transportation problems cannot be used. Two extensions of the network simplex method were implemented. One to support two additional restrictions, and the other for one additional restriction only. Both revealed to be less efficient than Cplex software, however, solving higher dimension problems. The developed algorithms were introduced in a Decision Support System.
منابع مشابه
A New Approach for Finding an Optimal Solution for Grey Transportation Problem
In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...
متن کاملUncertain goal programming models for bicriteria solid transportation problem
This paper investigates an uncertain bicriteria solid transportation problem. The supplies, demands, conveyance capacities, transportation cost and transportation time are regarded as uncertain variables. According to two types of methods to rank the uncertain variables, expected value goal programming model and chance-constrained goal programming model for the bicriteria solid transportation p...
متن کاملAn Approach for Searching Unsupported Integer Solutions of the Bicriteria Network Flow Problem
An approach for searching unsupported integer solutions of the bicriteria network flow problem is suggested. Some of the integer points in the triangles, defined by two neighbouring extreme nondominated points, are investigated by appropriately defined problems for a flow with one side constraint and for minimal cost flow.
متن کاملBicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
We present a new model, which is a generalization of the bicriterion median problem. We introduce two sum objectives and criteria dependent edge lengths. For this NP complete problem a solution method nding all the eÆcient solutions is presented. The method is a two-phases approach, which can easily be applied as an interactive method. In Phase 1 the supported solutions are found, and in Phase ...
متن کاملThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which can be exponential in the worst case. ...
متن کامل